Automorphic Decompositions of Graphs
نویسندگان
چکیده
Given graphs H and G, we say that H has a G-Decomposition if we are to partition the edge set of H so that for each part P of the partition, the subgraph of H induced by P is isomorphic to G. Let I(D) be the intersection generated by such a decomposition. We say that D is an automorphic decomposition of H with respect to G if I(D) ∼= H. In this talk, we will show several examples of such a decomposition as well as give necessary conditions for their existence. This will allow us to give several regularity results regarding graphs that can host an automorphic decomposition.
منابع مشابه
Simplicial Decompositions, Tree-decompositions and Graph Minors
The concepts of simplicial decompositions, tree-decompositions and simplicial tree-decompositions were all inspired by a common forerunner: the decompositions of finite graphs used by K. Wagner in his classic paper [ 13 ], in which he proved the equivalence of the 4-Colour-Conjecture to Hadwiger’s Conjecture for n = 5. To show that the 4CC implies Hadwiger’s Conjecture (for n = 5), Wagner used ...
متن کاملInstructional Conference on Representation Theory and Arithmetic Notes Taken by Mike Woodbury
Goal of Conference 2 1. Matt Emerton: Classical Modular Forms to Automorphic Forms 2 1.1. The Growth Condition 3 1.2. Passage to Representation Theory 4 2. David Nadler: Real Lie Groups 5 2.1. Basic Notions 5 2.2. Examples 5 2.3. Classification 6 2.4. Useful Decompositions 7 3. Jacob Lurie: Lie Theory and Algebraic Groups 8 3.1. Classification 9 4. Jacob Lurie: Representations of algebraic grou...
متن کاملAutomorphic chromatic index of generalized Petersen graphs
The automorphic A-chromatic index of a graph Γ is the minimum integer m for which Γ has a proper edge-coloring with m colors which is preserved by a given subgroup A of the full automorphism group of Γ. We compute the automorphic A-chromatic index of each generalized Petersen graph when A is the full automorphism group.
متن کاملComputing Bounded Path Decompositions in Logspace
The complexity of Graph Isomorphism (GI) is a long-standing open problem. GI is not known to be solvable in polynomial time and is unlikely to be NP-complete [BHZ87, Sch88]. Polynomial-time algorithms are known for GI of several special classes of graphs. One such interesting class is graphs excluding a fixed minor. Any family of graphs that is closed under taking minors falls into this class. ...
متن کاملPlanar Branch Decompositions
Branch decompositions were introduce by Robertson and Seymour 3] in their series of papers that proved Wagner's Conjecture. Branch decomposition can be used to solve NP-complete problems modeled on graphs but nding optimal branch decompositions of graphs is also NP-complete. We propose a practical implementation of an algorithm of Sey-mour and Thomas 4] for computing optimal branch decompositio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 27 شماره
صفحات -
تاریخ انتشار 2011